Brick tiling

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A linear algorithm for Brick Wang tiling

In computer graphics, Wang tiles are used as a tool to generate non periodic textures and patterns. We develop a framework and a method for the tiling problem which is suitable for applications. In particular, we apply our methodology to a special kind of Wang tiles, called Brick Wang tiles, introduced by Derouet-Jourdan et al. in 2015 to model wall patterns. We generalise their result by provi...

متن کامل

Brick Generation

A brick is a 3-connected graph such that the graph obtained from it by deleting any two distinct vertices has a perfect matching. The importance of bricks stems from the fact that they are building blocks of the matching decomposition procedure of Kotzig, and Lovász and Plummer. We prove that every brick except for the Petersen graph can be reduced to K4 or the prism by repeatedly applying a ce...

متن کامل

Starting from scratch and building brick by brick in comprehension.

During narrative comprehension, readers construct representations of the situation described by a text, called situation models. Theories of situation model construction and event comprehension posit two distinct types of situation model updating: incremental updating of individual situational dimensions, and global updates in which an old model is abandoned and a new one created. No research t...

متن کامل

Brick Manifolds and Toric Varieties of Brick Polytopes

In type A, Bott-Samelson varieties are posets in which ascending chains are flags of vector spaces. They come equipped with a map into the flag variety G/B. These varieties are mostly studied in the case in which the map into G/B is birational to the image. In this paper we study Bott-Samelsons for general types, more precisely, we study the combinatorics a fiber of the map into G/B when it is ...

متن کامل

Optimal Tiling

Iteration space tiling is a common strategy used by parallelizing compilers to reduce communication overhead. We address the problem of determining the optimal tile size (which minimizes the total execution time of the program), for a particular program schema. We use a realistic model of the architecture which accounts for coprocessors that permit overlapping of communication and computation, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Acta Crystallographica Section A Foundations and Advances

سال: 2016

ISSN: 2053-2733

DOI: 10.1107/s2053273316095255